﻿
@article{veltman_making_2005,
	title = {Making counterfactual assumptions},
	volume = {22},
	number = {2},
	journal = {Journal of Semantics},
	author = {F. Veltman},
	year = {2005},
	pages = {159}
},

@book{curry_combinatory_1958,
	address = {Amsterdam},
	title = {Combinatory logic},
	isbn = {9780720422085},
	publisher = {{North-Holland} Pub. Co.},
	author = {Haskell Curry},
	year = {1958}
},

@article{karttunen_syntax_1977,
	title = {Syntax and semantics of questions},
	volume = {1},
	number = {1},
	journal = {Linguistics and Philosophy},
	author = {L. Karttunen},
	year = {1977},
	pages = {3–44}
},

@article{shafer_constructive_1981,
	title = {Constructive probability},
	volume = {48},
	url = {http://dx.doi.org/10.1007/BF01064627},
	doi = {10.1007/BF01064627},
	number = {1},
	journal = {Synthese},
	author = {Glenn Shafer},
	month = jul,
	year = {1981},
	pages = {1--60}
},

@article{abramsky_introduction_2009,
	title = {Introduction to categories and categorical logic},
	journal = {New Structures for Physics, B. Coecke, Ed. Springer lecture Notes in Physics. To appear},
	author = {S. Abramsky and N. Tzevelekos},
	year = {2009}
},

@book{lincoln_understandinguniverse_2004,
	title = {Understanding the universe},
	isbn = {9812387056, 9789812387059},
	publisher = {World Scientific},
	author = {Don Lincoln},
	year = {2004},
	pages = {601}
},

@article{van_benthem_dynamic_2009,
	title = {Dynamic Update with Probabilities},
	volume = {93},
	url = {http://dx.doi.org/10.1007/s11225-009-9209-y},
	doi = {10.1007/s11225-009-9209-y},
	abstract = {Abstract  Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these
logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability
on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match
this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness
proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic logics as well. Finally,
we discuss how our basic update rule can be parameterized for different update policies, or learning methods.},
	number = {1},
	journal = {Studia Logica},
	author = {Johan van Benthem and Jelle Gerbrandy and Barteld Kooi},
	month = oct,
	year = {2009},
	pages = {67--96}
},

@book{hodges_model_1993,
	title = {Model theory},
	publisher = {Cambridge Univ Pr},
	author = {W. Hodges},
	year = {1993}
},

@article{van_benthem_conditional_2003,
	title = {Conditional Probability Meets Update Logic},
	volume = {12},
	url = {http://dx.doi.org/10.1023/A:1025002917675},
	doi = {10.1023/A:1025002917675},
	abstract = {Dynamic update of information states is a new paradigm in logicalsemantics. But such updates are also a traditional hallmark ofprobabilistic reasoning. This note brings the two perspectives togetherin an update mechanism for probabilities which modifies state spaces.},
	number = {4},
	journal = {Journal of Logic, Language and Information},
	author = {Johan van Benthem},
	year = {2003},
	pages = {409--421}
},

@book{van_dalen_logic_2004,
	address = {Berlin ; New York},
	edition = {4th ed.},
	title = {Logic and structure},
	isbn = {9783540208792},
	publisher = {{Springer-Verlag}},
	author = {D van Dalen},
	year = {2004}
},

@article{basu_travelers_1994,
	title = {The Traveler's Dilemma: Paradoxes of Rationality in Game Theory},
	volume = {84},
	issn = {00028282},
	shorttitle = {The Traveler's Dilemma},
	url = {http://www.jstor.org/stable/2117865},
	number = {2},
	journal = {The American Economic Review},
	author = {Kaushik Basu},
	month = may,
	year = {1994},
	note = {{ArticleType:} primary\_article / Issue Title: Papers and Proceedings of the Hundred and Sixth Annual Meeting of the American Economic Association / Full publication date: May, 1994 / Copyright © 1994 American Economic Association},
	pages = {391--395}
},

@book{lewis_symbolic_1951,
	title = {Symbolic Logic},
	publisher = {Dover Publications},
	author = {Clarence Irving Lewis and Cooper Harold Langford},
	year = {1951},
	pages = {518}
},

@book{osullivan_real_2009,
	address = {Sebastopol  {CA}},
	edition = {1st ed.},
	title = {Real world Haskell},
	isbn = {9780596514983},
	publisher = {{O'Reilly}},
	author = {Bryan {O'Sullivan} and John Goerzen and Don Stewart},
	year = {2009}
},

@book{doberkat_stochastic_2009,
	edition = {1st Edition.},
	title = {Stochastic Coalgebraic Logic},
	isbn = {3642029949},
	publisher = {Springer},
	author = {{Ernst-Erich} Doberkat},
	month = nov,
	year = {2009}
},

@article{jacobs_tutorialco_1997,
	title = {A tutorial on (co) algebras and (co) induction},
	journal = {{EATCS} Bulletin},
	author = {B. Jacobs and J. Rutten},
	year = {1997}
},

@article{baltag_probabilistic_2008,
	title = {Probabilistic dynamic belief revision},
	volume = {165},
	url = {http://dx.doi.org/10.1007/s11229-008-9369-8},
	doi = {10.1007/s11229-008-9369-8},
	abstract = {Abstract  We investigate the discrete (finite) case of the {Popper–Renyi} theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree
of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe
belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic
“action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws.},
	number = {2},
	journal = {Synthese},
	author = {Alexandru Baltag and Sonja Smets},
	month = nov,
	year = {2008},
	pages = {179--202}
},

@book{robinson_non-standard_1996,
	title = {Non-standard analysis},
	url = {http://books.google.com/books?hl=en&amp;lr=&amp;id=Eq0U3Eo_KSgC&amp;oi=fnd&amp;pg=PA1&amp;dq=Non-Standard+Analysis&amp;ots=NYs-udHPVK&amp;sig=NAt2cshx0ncT9Vjafy2C6L8zibQ},
	publisher = {Princeton University Press},
	author = {A. Robinson},
	year = {1996}
},

@book{quine_web_1978,
	address = {New York},
	edition = {2nd ed.},
	title = {The web of belief},
	isbn = {9780075536093},
	publisher = {{McGraw-Hill}},
	author = {W Quine},
	year = {1978}
},

@book{boolos_logic_1995,
	title = {The logic of provability},
	isbn = {0521483255, 9780521483254},
	publisher = {Cambridge University Press},
	author = {George Boolos},
	year = {1995},
	pages = {318}
},

@book{nahin_imaginary_1998,
	title = {An Imaginary Tale: The Story of √- 1},
	publisher = {Princeton, {NJ:} Princeton University Press},
	author = {P J Nahin},
	year = {1998}
},

@book{marker_model_2002,
	address = {New York},
	title = {Model theory : an introduction},
	isbn = {9780387987606},
	publisher = {Springer},
	author = {D Marker},
	year = {2002}
},

@article{ono_intuitionistic_1977,
	title = {On some intuitionistic modal logics},
	volume = {13},
	issn = {0034-5318},
	url = {http://www.projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.prims/1195189604},
	doi = {10.2977/prims/1195189604},
	number = {3},
	journal = {Publications of the Research Institute for Mathematical Sciences},
	author = {Hiroakira Ono},
	year = {1977},
	pages = {687--722}
},

@article{krauss_defining_????,
	title = {Defining Recursive Functions in {Isabelle/HOL}},
	author = {Alexander Krauss},
	pages = {1–19}
},

@article{galles_axiomatic_1998,
	title = {An axiomatic characterization of causal counterfactuals},
	volume = {3},
	number = {1},
	journal = {Foundations of Science},
	author = {D. Galles and J. Pearl},
	year = {1998},
	pages = {151–182}
},

@book{robinson_introduction_1963,
	title = {Introduction to model theory and to the metamathematics of algebra},
	publisher = {Springer},
	author = {A. Robinson},
	year = {1963}
},

@book{gladwell_tipping_2002,
	address = {Boston},
	edition = {1st Back Bay pbk. ed.},
	title = {The tipping point : how little things can make a big difference},
	isbn = {9780316346627},
	publisher = {Back Bay Books},
	author = {Malcolm Gladwell},
	year = {2002}
},

@article{fernandes_topos-theoretic_2009,
	title = {A {Topos-Theoretic} Approach to Counterfactual Logic},
	volume = {256},
	url = {http://portal.acm.org/citation.cfm?id=1660290},
	abstract = {Topoi are known to be categories with extra properties that make them much alike the category of Sets. In a Topoi it is possible to define adequate notions of membership, elements and subobjects, power ''sets'', and finally, every Topoi has an internal logic able to justify any reasoning carried inside it. Most of the cases, this logic is not Classical {(Boolean).} The general logic for the Topoi is Intuitionistic Higher-order Logic. Topoi have their linguistic counter-part provided by Local Set Theories {(LST).} There is a deductive apparatus, in the style of Sequent Calculus, able to justify logical consequence inside any {LST.} Counterfactuals are subtle conditionals largely studied by the philosophical and logic community. Since Lewis, counterfactual have a uniform semantics provided by means of Neighborhood systems on top a possible world style semantics. In this article, taking into account the fundamental theorem on Topoi, we define, by means of the internal logic of Graphs, Lewis counterfactuals and show how to use the {LST} deductive apparatus to prove properties on counterfactual logic. This article can be also used as an initial step towards the definition of deductive systems for counterfactual logic, taken in an alternative way the ones already existent in the logic literature.},
	journal = {Electron. Notes Theor. Comput. Sci.},
	author = {Ricardo Queiroz de Araujo Fernandes and Edward Hermann Haeusler},
	year = {2009},
	keywords = {category theory, counterfactuals, logic, topos},
	pages = {33--47}
},

@book{ebbinghaus_finite_2006,
	address = {{[New} York]},
	edition = {2nd rev. and enlarged ed. 1999.},
	title = {Finite Model Theory},
	isbn = {9783540287872},
	publisher = {{Springer-Verlag} Berlin Heidelberg},
	author = {{Heinz-Dieter} Ebbinghaus},
	year = {2006}
},

@article{jacobs_tutorialco_1997-1,
	title = {A tutorial on (co) algebras and (co) induction},
	journal = {{EATCS} Bulletin},
	author = {B. Jacobs and J. Rutten},
	year = {1997}
},

@article{weatherson_classical_2003,
	title = {From Classical to Intuitionistic Probability},
	volume = {44},
	url = {http://projecteuclid.org/DPubS?verb=Display&version=1.0&service=UI&handle=euclid.ndjfl/1082637807&page=record},
	doi = {10.1305/ndjfl/1082637807},
	abstract = {We generalize the Kolmogorov axioms for probability calculus to obtain conditions defining, for any given logic, a class of probability functions relative to that logic, coinciding with the standard probability functions in the special case of classical logic but allowing consideration of other classes of  "essentially Kolmogorovian" probability functions relative to other logics. We take a broad view of the Bayesian approach as dictating inter alia that from the perspective of a given logic, rational degrees of belief are those representable by probability functions from the class appropriate to that logic. Classical Bayesianism, which fixes the logic as classical logic, is only one version of this general approach. Another, which we call Intuitionistic Bayesianism, selects intuitionistic logic as the preferred logic and the associated class of probability functions as the right class of candidate representions of epistemic states (rational allocations of degrees of belief). Various objections to classical Bayesianism are, we argue, best met by passing to intuitionistic Bayesianism—in which the probability functions are taken relative to intuitionistic logic—rather than by adopting a radically {non-Kolmogorovian,} for example, nonadditive, conception of (or substitute for) probability functions, in spite of the popularity of the latter response among those who have raised these objections. The interest of intuitionistic Bayesianism is further enhanced by the availability of a Dutch Book argument justifying the selection of intuitionistic probability functions as guides to rational betting behavior when due consideration is paid to the fact that bets are settled only when/if the outcome bet on becomes known.},
	number = {2},
	journal = {Notre Dame Journal of Formal Logic},
	author = {Brian Weatherson},
	year = {2003},
	pages = {111--123}
},

@book{schoenfield_degrees_1971,
	address = {Amsterdam},
	title = {Degrees of unsolvability},
	publisher = {Elsevier},
	author = {Joseph R Schoenfield},
	year = {1971}
},

@article{hilbert_neubegrndung_1922,
	title = {Neubegründung der Mathematik. Erste Mitteilung},
	volume = {1},
	url = {http://dx.doi.org/10.1007/BF02940589},
	doi = {10.1007/BF02940589},
	number = {1},
	journal = {Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg},
	author = {David Hilbert},
	month = dec,
	year = {1922},
	pages = {157--177}
},

@book{lewis_plurality_2001,
	title = {On the plurality of worlds},
	isbn = {0631224262, 9780631224266},
	publisher = {{Wiley-Blackwell}},
	author = {David K. Lewis},
	month = feb,
	year = {2001},
	pages = {292}
},

@book{lambalgen_proper_2005,
	title = {The Proper Treatment of Events},
	isbn = {1405112123},
	publisher = {{Wiley-Blackwell}},
	author = {Michiel Van Lambalgen and Fritz Hamm},
	month = feb,
	year = {2005}
},

@inproceedings{levesque_logic_1984,
	title = {A logic of implicit and explicit belief},
	booktitle = {Proceedings of the National Conference on Artificial Intelligence},
	author = {H. J Levesque},
	year = {1984},
	pages = {198–202}
},

@article{huffman_transfer_2005,
	title = {Transfer Principle Proof Tactic for Nonstandard Analysis},
	number = {July},
	journal = {Engineering},
	author = {Brian Huffman},
	year = {2005},
	pages = {1–9}
},

@article{heim_semantics_1982,
	title = {The semantics of definite and indefinite noun phrases},
	journal = {Electronic Doctoral Dissertations for {UMass} Amherst},
	author = {I. R Heim},
	year = {1982}
},

@article{okeefe_towardsreadable_2004,
	title = {Towards a Readable Formalisation of Category Theory},
	volume = {91},
	issn = {15710661},
	url = {http://linkinghub.elsevier.com/retrieve/pii/S1571066103000215},
	doi = {10.1016/j.entcs.2003.12.014},
	journal = {Electronic Notes in Theoretical Computer Science},
	author = {G. {O'Keefe}},
	month = feb,
	year = {2004},
	keywords = {category, formalised mathematics, theorem proving},
	pages = {212–228}
},

@article{lewis_causation_2000,
	title = {Causation as influence},
	volume = {97},
	number = {4},
	journal = {The Journal of Philosophy},
	author = {David K. Lewis},
	year = {2000},
	pages = {182–197}
},

@article{palmigiano_dualities_2004,
	title = {Dualities for Intuitionistic Modal Logics},
	url = {http://staff.science.uva.nl/~apalmigi/ch_5.pdf},
	journal = {Dick de Jongh's Liber Amicorum},
	author = {Alessandra Palmigiano},
	year = {2004},
	keywords = {duality, kripke-semantics, modal-logic},
	pages = {168, 151}
},

@book{knuth_art_1997,
	address = {Reading  Mass.},
	edition = {3rd ed.},
	title = {The Art of Computer Programming, Volume 1: Fundamental Algorithms},
	isbn = {9780201896831},
	publisher = {{Addison-Wesley}},
	author = {Donald Knuth},
	year = {1997}
},

@book{levitt_superfreakonomics_2009,
	address = {New York :},
	title = {Superfreakonomics global cooling, patriotic prostitutes, and why suicide bombers should buy life insurance},
	isbn = {9780061959936},
	publisher = {{HarperCollins} e-books,},
	author = {Steven Levitt and Stephen Dubner},
	year = {2009}
},

@article{nipkow_tutorial_????,
	title = {A Tutorial Introduction to Structured Isar Proofs},
	author = {Tobias Nipkow}
},

@article{clapeyron_mmoire_1834,
	title = {Mémoire sur la puissance motrice de la chaleur},
	volume = {14},
	journal = {J. l’ecole polytechnique},
	author = {É Clapeyron},
	year = {1834},
	pages = {153–190}
},

@book{lutz_learning_2009,
	address = {Sebastopol  {CA}},
	edition = {4th ed.},
	title = {Learning Python},
	isbn = {9780596158064},
	publisher = {{O'Reilly}},
	author = {Mark Lutz},
	year = {2009}
},

@book{woodward_making_2005,
	title = {Making Things Happen},
	isbn = {0195189531, 9780195189537},
	publisher = {Oxford University Press {US}},
	author = {James Woodward},
	month = oct,
	year = {2005},
	pages = {430}
},

@book{hersh_18_2006,
	title = {18 unconventional essays on the nature of mathematics},
	isbn = {0387257179, 9780387257174},
	publisher = {Birkhäuser},
	author = {Reuben Hersh},
	year = {2006},
	pages = {356}
},

@article{zagzebski_inescapability_1994,
	title = {The Inescapability of Gettier Problems},
	volume = {44},
	issn = {00318094},
	url = {http://www.jstor.org/stable/2220147},
	number = {174},
	journal = {The Philosophical Quarterly},
	author = {Linda Zagzebski},
	year = {1994},
	note = {{ArticleType:} primary\_article / Full publication date: Jan., 1994 / Copyright © 1994 The Philosophical Quarterly},
	pages = {65--73}
},

@book{lewis_counterfactuals_2001,
	title = {Counterfactuals},
	isbn = {0631224254, 9780631224259},
	publisher = {{Wiley-Blackwell}},
	author = {David K. Lewis},
	year = {2001},
	pages = {170}
},

@book{adler_reasoning_2008,
	title = {Reasoning},
	isbn = {0521848156, 9780521848152},
	publisher = {Cambridge University Press},
	author = {Jonathan Eric Adler and Lance J. Rips},
	month = may,
	year = {2008},
	pages = {1057}
},

@book{collins_causation_2004,
	title = {Causation and counterfactuals},
	isbn = {0262532565, 9780262532563},
	publisher = {{MIT} Press},
	author = {John David Collins and Edward Jonathan Hall and Laurie Ann Paul},
	year = {2004},
	pages = {500}
},

@book{dennett_intentional_1998,
	address = {Cambridge  Mass},
	edition = {7th},
	title = {The Intentional Stance},
	isbn = {9780262540537},
	publisher = {{MIT} Press},
	author = {Daniel Dennett},
	year = {1998}
},

@article{halpern_set-theoretic_1999,
	title = {Set-theoretic completeness for epistemic and conditional logic},
	volume = {26},
	url = {http://portal.acm.org/citation.cfm?id=590305},
	abstract = {The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of formulas in the language (the semantics), a collection of axioms and rules of inference characterizing reasoning (the proof theory), and then relate the proof theory to the semantics via soundness and completeness results. Here we consider an approach that is more common in the economics literature, which works purely at the semantic, set\&dash;theoretic level. We provide set\&dash;theoretic completeness results for a number of epistemic and conditional logics, and contrast the expressive power of the syntactic and set\&dash;theoretic approaches.},
	number = {1-4},
	journal = {Annals of Mathematics and Artificial Intelligence},
	author = {Joseph Y. Halpern},
	year = {1999},
	pages = {1--27}
},

@article{haftmann_haskell-style_2009,
	title = {Haskell-style type classes with {Isabelle/Isar}},
	number = {April},
	author = {Florian Haftmann},
	year = {2009}
},

@book{van_benthem_modal_2010,
	title = {Modal Logic for Open Minds},
	isbn = {1575866986, 9781575866987},
	publisher = {Center for the Study of Language and Inf},
	author = {Johan van Benthem},
	month = feb,
	year = {2010},
	pages = {350}
},

@book{norvig_paradigms_1992,
	address = {San Francisco  Calif.},
	title = {Paradigms of Artificial Intelligence Programming: Case Studies in Common  Lisp},
	isbn = {9781558601918},
	publisher = {Morgan Kaufman Publishers},
	author = {Peter Norvig},
	year = {1992}
},

@inproceedings{pacuit_noteexplicit_2005,
	title = {A note on some explicit modal logics},
	booktitle = {Proceedings of the Fifth Panhellenic Logic Symposium},
	author = {E. Pacuit},
	year = {2005},
	pages = {117–125}
},

@book{vath_nonstandard_2007,
	address = {Basel {;;Boston}},
	title = {Nonstandard analysis},
	isbn = {9783764377731},
	publisher = {Birkhäuser},
	author = {Martin Väth},
	year = {2007}
},

@book{hersh_what_1997,
	title = {What is mathematics, really?},
	publisher = {Oxford University Press, {USA}},
	author = {R. Hersh},
	year = {1997}
},

@article{sambin_basic_2000,
	title = {Basic Logic: Reflection, Symmetry, Visibility},
	volume = {65},
	issn = {00224812},
	shorttitle = {Basic Logic},
	url = {http://www.jstor.org/stable/2586685},
	abstract = {We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection. To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube.},
	number = {3},
	journal = {The Journal of Symbolic Logic},
	author = {Giovanni Sambin and Giulia Battilotti and Claudia Faggian},
	month = sep,
	year = {2000},
	note = {{ArticleType:} primary\_article / Full publication date: Sep., 2000 / Copyright © 2000 Association for Symbolic Logic},
	pages = {979--1013}
},

@article{rantala_impossible_1982,
	title = {Impossible worlds semantics and logical omniscience},
	journal = {Intensional Logic: Theory and Applications},
	author = {V. Rantala},
	year = {1982}
},

@book{jowett_timaeus_1998,
	title = {Timaeus},
	copyright = {Not copyrighted in the United States. If you live elsewhere check the laws of your country before downloading this ebook.},
	lccn = {{EText-No.} 1572},
	url = {http://www.gutenberg.org/etext/1572},
	author = {Plato},
	translator = {Benjamin Jowett},
	month = dec,
	year = {1998},
	note = {{LoC} Class {PA:} Language and Literatures: Classical Languages and Literature},
	keywords = {Classical literature, Cosmology -- Early works to 1800}
},

@book{sorensen_brief_2003,
	address = {New York},
	title = {A Brief History of the Paradox: Philosophy and The Labyrinths of The Mind},
	isbn = {9780195159035},
	publisher = {Oxford University Press},
	author = {Roy Sorensen},
	year = {2003},
	pages = {394}
},

@book{priest_logic:very_2000,
	title = {Logic: A Very Short Introduction},
	isbn = {0192893203, 9780192893208},
	publisher = {Oxford University Press},
	author = {Graham Priest},
	year = {2000},
	pages = {152}
},

@book{hutton_programming_2007,
	address = {Cambridge},
	title = {Programming in Haskell},
	isbn = {9780521871723},
	publisher = {Cambridge University Press},
	author = {Graham Hutton},
	year = {2007}
},

@book{primiero_information_2007,
	title = {Information and Knowledge},
	isbn = {1402061692, 9781402061691},
	publisher = {Springer},
	author = {Giuseppe Primiero},
	month = dec,
	year = {2007},
	pages = {215}
},

@book{smullyan_set_1996,
	title = {Set theory and the continuum problem},
	author = {R. M Smullyan and M. Fitting},
	year = {1996}
},

@book{lenzen_recent_1978,
	title = {Recent work in epistemic logic},
	isbn = {9519505407, 9789519505404},
	publisher = {{North-Holland}},
	author = {Wolfgang Lenzen},
	year = {1978},
	pages = {702}
},

@book{gdel_consistency_1940,
	title = {The consistency of the axiom of choice and of the generalized continuum-hypothesis with the axioms of set theory},
	isbn = {0691079277, 9780691079271},
	publisher = {Princeton University Press},
	author = {Kurt Gödel and George William Brown},
	month = sep,
	year = {1940},
	pages = {116}
},

@book{ditmarsch_dynamic_2007,
	edition = {1},
	title = {Dynamic Epistemic Logic},
	isbn = {1402069081},
	publisher = {Springer},
	author = {Hans van Ditmarsch and Wiebe van der Hoek and Barteld Kooi},
	month = nov,
	year = {2007}
},

@book{ariely_predictably_2008,
	edition = {1},
	title = {Predictably Irrational: The Hidden Forces That Shape Our Decisions},
	isbn = {{006135323X}},
	shorttitle = {Predictably Irrational},
	publisher = {{HarperCollins}},
	author = {Dan Ariely},
	month = feb,
	year = {2008}
},

@book{halloway_programming_2009,
	address = {Raleigh  {N.C.}},
	title = {Programming Clojure},
	isbn = {9781934356333},
	publisher = {Pragmatic Bookshelf},
	author = {Stuart Halloway},
	year = {2009}
},

@book{gabbay_handbook_2002,
	address = {Dordrecht [u.a.]},
	edition = {2nd},
	title = {Handbook of Philosophical Logic: Volume 6},
	isbn = {1402005830},
	shorttitle = {Handbook of Philosophical Logic},
	publisher = {Springer},
	author = {Dov M. Gabbay and F. Guenthner},
	month = may,
	year = {2002}
},

@book{emerson_essays_2008,
	title = {Essays — First Series},
	copyright = {Not copyrighted in the United States. If you live elsewhere check the laws of your country before downloading this ebook.},
	lccn = {{EText-No.} 2944},
	url = {http://www.gutenberg.org/etext/2944},
	author = {Ralph Waldo Emerson},
	month = dec,
	year = {2008},
	note = {{LoC} Class {PS:} Language and Literatures: American and Canadian literature},
	keywords = {American essays -- 19th century}
},

@article{lemmon_symposium:_1959,
	title = {Symposium: Is There Only One Correct System of Modal Logic?},
	volume = {33},
	issn = {03097013},
	shorttitle = {Symposium},
	url = {http://www.jstor.org/stable/4106619},
	journal = {Proceedings of the Aristotelian Society, Supplementary Volumes},
	author = {E. J. Lemmon and G. P. Henderson},
	year = {1959},
	note = {{ArticleType:} primary\_article / Full publication date: 1959 / Copyright © 1959 The Aristotelian Society},
	pages = {23--56}
},

@article{artemov_introducing_2005,
	title = {Introducing justification into epistemic logic},
	volume = {15},
	number = {6},
	journal = {Journal of Logic and Computation},
	author = {S. N. Artemov and E. Nogina},
	year = {2005},
	pages = {1059}
},

@article{artemov_justification_2007,
	title = {Justification logic},
	journal = {{CUNY} Graduate Center, New York},
	author = {S. N. Artemov},
	year = {2007}
},

@article{van_der_does_updatemight_1997,
	title = {An Update on {"Might"}},
	volume = {6},
	issn = {09258531},
	url = {http://www.jstor.org/stable/40181598},
	abstract = {This paper is on the update semantics for "might" of Veltman (1996). Three consequence relations are introduced and studied in an abstract setting. Next we present sequent-style systems for each of the consequence relations. We show the logics to be complete and decidable. The paper ends with a syntactic cut elimination result.},
	number = {4},
	journal = {Journal of Logic, Language, and Information},
	author = {Jaap van der Does and Willem Groeneveld and Frank Veltman},
	month = oct,
	year = {1997},
	note = {{ArticleType:} primary\_article / Issue Title: Special Issue on Modal Logic and Dynamics / Full publication date: Oct., 1997 / Copyright © 1997 Springer},
	pages = {361--380}
},

@article{knuth_concrete_1988,
	title = {Concrete mathematics},
	url = {http://scholar.google.com/scholar?hl=en&btnG=Search&q=intitle:Concrete+mathematics#3},
	author = {Donald E. Knuth and O. Patashnik},
	year = {1988}
},

@article{wenzel_isabelle/isar_2009,
	title = {The {Isabelle/Isar} Reference Manual},
	author = {Makarius Wenzel and Stefan Berghofer and Timothy Bourke and Lucas Dixon and Florian Haftmann and Gerwin Klein and Alexander Krauss and Tobias Nipkow and Larry Paulson and Sebastian Skalberg},
	year = {2009}
},

@article{wason_reasoning_1968,
	title = {Reasoning about a rule},
	volume = {20},
	issn = {{0033-555X}},
	url = {http://www.informaworld.com/10.1080/14640746808400161},
	doi = {10.1080/14640746808400161},
	number = {3},
	journal = {Quarterly Journal of Experimental Psychology},
	author = {P. C. Wason},
	year = {1968},
	pages = {273}
},

@book{whitman_leaves_2008,
	title = {Leaves of Grass},
	copyright = {Not copyrighted in the United States. If you live elsewhere check the laws of your country before downloading this ebook.},
	lccn = {{EText-No.} 1322},
	url = {http://www.gutenberg.org/etext/1322},
	author = {Walt Whitman},
	month = aug,
	year = {2008},
	note = {{LoC} Class {PS:} Language and Literatures: American and Canadian literature},
	keywords = {Poetry}
},

@article{gillies_epistemic_2004,
	title = {Epistemic conditionals and conditional epistemics},
	volume = {38},
	number = {4},
	journal = {Noûs},
	author = {A. S Gillies},
	year = {2004},
	pages = {585–616}
},

@book{hintikka_knowledge_1969,
	title = {Knowledge and Belief},
	publisher = {Cornell Univ. Pr.},
	author = {Jaakko K. Hintikka},
	year = {1969},
	pages = {179}
},

@article{wenzel_isabelle_2009,
	title = {The Isabelle System Manual},
	number = {April},
	author = {Makarius Wenzel and Stefan Berghofer},
	year = {2009}
},

@article{berghofer_meta-theory_2009,
	title = {Meta-theory of first-order predicate logic},
	author = {Stefan Berghofer},
	year = {2009},
	pages = {1–49}
},

@article{servi_modal_1977,
	title = {On Modal Logic with an Intuitionistic Base},
	volume = {36},
	issn = {00393215},
	url = {http://www.jstor.org/stable/20014847},
	abstract = {A definition of the concept of {"Intuitionist} Modal Analogue" is presented and motivated through the existence of a theorem preserving translation from {MIPC} (see [2]) to a bimodal {S₄-S₅} calculus.},
	number = {3},
	journal = {Studia Logica: An International Journal for Symbolic Logic},
	author = {Gisèle Fischer Servi},
	year = {1977},
	note = {{ArticleType:} primary\_article / Full publication date: 1977 / Copyright © 1977 Springer},
	pages = {141--149}
},

@article{author_journal_2010,
	title = {Journal of Philosophy, Inc.},
	volume = {70},
	number = {17},
	author = {Causation Author and David Lewis Source and The Journal and Seventieth Annual Meeting},
	year = {2010},
	pages = {556–567}
},

@article{van_benthem_logical_2008,
	title = {Logical dynamics of information and interaction},
	journal = {Manuscript},
	author = {Johan van Benthem},
	year = {2008}
},

@book{hendricks_mainstream_2006,
	title = {Mainstream and formal epistemology},
	publisher = {Cambridge Univ Pr},
	author = {V. F Hendricks},
	year = {2006}
},

@book{roman_lattices_2008,
	edition = {1},
	title = {Lattices and Ordered Sets},
	isbn = {0387789006},
	publisher = {Springer},
	author = {Steven Roman},
	month = sep,
	year = {2008}
},

@book{levesque_logic_2000,
	address = {Cambridge  Mass.},
	title = {The logic of knowledge bases},
	isbn = {9780262122320},
	publisher = {{MIT} Press},
	author = {Hector Levesque and Gerhard Lakemeyer},
	year = {2000}
},

@book{jowett_republic_1998,
	title = {The Republic},
	copyright = {Not copyrighted in the United States. If you live elsewhere check the laws of your country before downloading this ebook.},
	lccn = {{EText-No.} 1497},
	url = {http://www.gutenberg.org/etext/1497},
	author = {Plato},
	translator = {Benjamin Jowett},
	month = oct,
	year = {1998},
	note = {{LoC} Class {PA:} Language and Literatures: Classical Languages and Literature},
	keywords = {Classical literature}
},

@article{quine_two_1951,
	title = {Two Dogmas of Empiricism},
	volume = {60},
	issn = {00318108},
	shorttitle = {Main Trends in Recent Philosophy},
	url = {http://www.jstor.org/stable/2181906},
	number = {1},
	journal = {The Philosophical Review},
	author = {W. V. Quine},
	year = {1951},
	note = {{ArticleType:} primary\_article / Full publication date: Jan., 1951 / Copyright © 1951 Cornell University},
	pages = {20--43}
},

@incollection{berghofer_inductive_1999,
	title = {Inductive Datatypes in {HOL} — Lessons Learned in {Formal-Logic} Engineering},
	url = {http://dx.doi.org/10.1007/3-540-48256-3_3},
	abstract = {{Isabelle/HOL} has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions.
In contrast to its predecessors and most other implementations, {Isabelle/HOL} datatypes may be mutually and indirect recursive,
even infinitely branching. We also support inverted datatype definitions for characterizing existing types as being inductive
ones later. All our constructions are fully definitional according to established {HOL} tradition. Stepping back from the logical
details, we also see this work as a typical example of what could be called {“Formal-Logic} Engineering”. We observe that building
realistic theorem proving environments involves further issues rather than pure logic only.},
	booktitle = {Theorem Proving in Higher Order Logics},
	author = {Stefan Berghofer and Markus Wenzel},
	year = {1999},
	pages = {839}
},

@book{aiello_handbook_2007,
	title = {Handbook of spatial logics},
	publisher = {Springer},
	author = {M. Aiello and I. {Pratt-Hartmann} and Johan van Benthem},
	year = {2007}
},

@book{depaul_resurrecting_2001,
	title = {Resurrecting old-fashioned foundationalism},
	isbn = {0847692892, 9780847692897},
	publisher = {Rowman \& Littlefield},
	author = {Michael Raymond {DePaul}},
	year = {2001},
	pages = {132}
},

@article{hommersom_toward_2005,
	title = {Toward Reasoning about Security Protocols: A Semantic Approach},
	volume = {126},
	shorttitle = {Toward Reasoning about Security Protocols},
	journal = {Electronic Notes in Theoretical Computer Science},
	author = {A. Hommersom and {John-Jules} Ch Meyer and E. de Vink},
	year = {2005},
	pages = {53–75}
},

@book{knuth_art_2006,
	address = {Boston  Mass.},
	edition = {3. ed., 20. print., [updat. and rev.].},
	title = {The Art of Computer Programming, Volume 2: Seminumerical Algorithms},
	isbn = {9780201896848},
	publisher = {{Addison-Wesley}},
	author = {Donald Knuth},
	year = {2006}
},

@book{blackburn_handbook_2006,
	title = {Handbook of modal logic},
	author = {P. Blackburn and Johan van Benthem and F. Wolter},
	year = {2006}
},

@book{lutz_programming_2001,
	address = {Beijing  {;Sebastopol}  {CA}},
	edition = {2nd ed.},
	title = {Programming Python},
	isbn = {9780596000851},
	publisher = {{O'Reilly}},
	author = {Mark Lutz},
	year = {2001}
},

@book{kernighan_c_1988,
	title = {The C programming language},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.87.8430&amp;rep=rep1&amp;type=pdf},
	publisher = {Citeseer},
	author = {B. W Kernighan and D. M Ritchie},
	year = {1988},
	pages = {1–237}
},

@article{blute_category_2004,
	title = {Category theory for linear logicians},
	journal = {Linear Logic in Computer Science},
	author = {R. Blute and P. Scott},
	year = {2004},
	pages = {3–64}
},

@article{fitting_logic_2004,
	title = {A logic of explicit knowledge},
	journal = {Logica Yearbook},
	author = {M. Fitting},
	year = {2004},
	pages = {11–22}
},

@article{veltman_defaults_1996,
	title = {Defaults in update semantics},
	volume = {25},
	number = {3},
	journal = {Journal of philosophical logic},
	author = {F. Veltman},
	year = {1996},
	pages = {221–261}
},

@book{goldblatt_lectureshyperreals_1998,
	title = {Lectures on the Hyperreals},
	url = {http://www.gbv.de/dms/goettingen/244289204.pdf},
	publisher = {Springer New York},
	author = {R. Goldblatt},
	year = {1998}
},

@article{stalnaker_theory_1968,
	title = {A theory of conditionals},
	volume = {2},
	journal = {Studies in logical theory},
	author = {R. Stalnaker},
	year = {1968},
	pages = {98–112}
},

@article{baltag_reasoning_2004,
	title = {Reasoning about Dynamic Epistemic Logic},
	author = {A. Baltag and B. Coecke and M. Sadrzadeh},
	year = {2004}
},

@book{goldblatt_topoicategorial_1979,
	title = {Topoi, the categorial analysis of logic},
	publisher = {North Holland},
	author = {R. Goldblatt},
	year = {1979}
},

@book{harrison_handbook_2009,
	title = {Handbook of practical logic and automated reasoning},
	publisher = {Cambridge University Press New York, {NY,} {USA}},
	author = {J. Harrison},
	year = {2009}
},

@article{bierman_intuitionistic_2001,
	title = {On an Intuitionistic Modal Logic},
	volume = {65},
	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.5279},
	journal = {{STUDIA} {LOGICA}},
	author = {G M Bierman and V C V de Paiva},
	year = {2001},
	pages = {2000}
},

@book{van_ditmarsch_information-based_2006,
	title = {{Information-Based} Security Protocols for Ideal Agents},
	publisher = {Storming Media},
	author = {Hans van Ditmarsch},
	year = {2006}
},

@book{browne_garden_1736,
	title = {The garden of Cyrus},
	publisher = {printed in the year},
	author = {Sir Thomas Browne},
	year = {1736},
	pages = {58}
},

@book{jech_set_2003,
	address = {Berlin, New York},
	edition = {The 3rd millennium ed., rev. and expanded.},
	title = {Set theory},
	isbn = {9783540440857},
	publisher = {Springer},
	author = {Thomas Jech},
	year = {2003}
},

@book{barwise_vicious_1996,
	title = {Vicious circles},
	isbn = {1575860082, 9781575860084},
	publisher = {{CSLI} Publications},
	author = {Jon Barwise and Lawrence Stuart Moss},
	year = {1996},
	pages = {390}
},

@article{fitting_logic_2005,
	title = {The logic of proofs, semantically},
	volume = {132},
	number = {1},
	journal = {Annals of Pure and Applied Logic},
	author = {M. Fitting},
	year = {2005},
	pages = {1–25}
},

@article{ballarin_tutorial_2009,
	title = {Tutorial to Locales and Locale Interpretation},
	author = {Clemens Ballarin},
	year = {2009},
	pages = {1–17}
},

@article{kooi_probabilistic_2003,
	title = {Probabilistic Dynamic Epistemic Logic},
	volume = {12},
	url = {http://dx.doi.org/10.1023/A:1025050800836},
	doi = {10.1023/A:1025050800836},
	abstract = {In this paper I combine the dynamic epistemic logic {ofGerbrandy} (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the {MontyHall} Dilemma.},
	number = {4},
	journal = {Journal of Logic, Language and Information},
	author = {Barteld P. Kooi},
	year = {2003},
	pages = {381--408}
},

@article{van_benthem_inference_2009,
	title = {Inference, promotion, and the dynamics of awareness},
	journal = {{ILLC} Amsterdam. To appear in Knowledge, Rationality and Action},
	author = {Johan van Benthem and F. R {Velázquez-Quesada}},
	year = {2009}
},

@book{gradel_finite_2007,
	address = {{Berlin;Heidelberg;New} York},
	title = {Finite model theory and its applications with 2 tables},
	isbn = {9783540004288},
	publisher = {Springer},
	author = {Erich Grädel},
	year = {2007}
},

@book{priest_doubt_2006,
	address = {Oxford ; New York},
	title = {Doubt truth to be a liar},
	isbn = {9780199263288},
	publisher = {Clarendon Press; Oxford University Press},
	author = {Graham Priest},
	year = {2006}
},

@article{halpern_causes_2005,
	title = {Causes and explanations: A structural-model approach. Part {II:} Explanations},
	volume = {56},
	shorttitle = {Causes and explanations},
	number = {4},
	journal = {The British Journal for the Philosophy of Science},
	author = {J. Y Halpern and J. Pearl},
	year = {2005},
	pages = {889}
},

@book{bennett_philosophical_2003,
	title = {A philosophical guide to conditionals},
	publisher = {Oxford University Press, {USA}},
	author = {J. F Bennett},
	year = {2003}
},

@book{blackburn_modal_2001,
	title = {Modal logic},
	publisher = {Cambridge Univ Pr},
	author = {P. Blackburn and M. De Rijke and Y. Venema},
	year = {2001}
},

@book{nipkow_isabelle/hol:proof_2002,
	edition = {1},
	series = {{LNCS}},
	title = {{Isabelle/HOL:} A Proof Assistant for {Higher-Order} Logic},
	volume = {2283},
	isbn = {3540433767},
	shorttitle = {{Isabelle/HOL}},
	publisher = {Springer},
	author = {Tobias Nipkow and Lawrence C. Paulson and Markus Wenzel},
	month = may,
	year = {2002}
},

@article{agray_ban_2002,
	title = {On {BAN} logics for industrial security protocols},
	journal = {Lecture notes in computer science},
	author = {N. Agray and W. Van Der Hoek and E. De Vink},
	year = {2002},
	pages = {29–36}
},

@article{nipkow_fundamental_2009,
	title = {Fundamental Properties of Lambda-calculus},
	author = {Tobias Nipkow and Stefan Berghofer},
	year = {2009},
	pages = {1–69}
},

@article{velzquez-quesada_inference_2009,
	title = {Inference and update},
	volume = {169},
	number = {2},
	journal = {Synthese},
	author = {F. R {Velázquez-Quesada}},
	year = {2009},
	pages = {283–300}
},

@book{heijenoort_frege_1999,
	title = {From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931},
	isbn = {{158348597X}},
	shorttitle = {From Frege to Gödel},
	publisher = {{iUniverse}},
	author = {Jean van Heijenoort},
	month = dec,
	year = {1999}
},

@article{lewis_causation_1973,
	title = {Causation},
	volume = {70},
	issn = {{0022362X}},
	url = {http://www.jstor.org/stable/2025310},
	number = {17},
	journal = {The Journal of Philosophy},
	author = {David K. Lewis},
	month = oct,
	year = {1973},
	note = {{ArticleType:} primary\_article / Issue Title: Seventieth Annual Meeting of the American Philosophical Association Eastern Division / Full publication date: Oct. 11, 1973 / Copyright © 1973 Journal of Philosophy, Inc.},
	pages = {556--567}
},

@article{goldblatt_mathematical_2003,
	title = {Mathematical modal logic: A view of its evolution},
	volume = {1},
	shorttitle = {Mathematical modal logic},
	number = {5-6},
	journal = {Journal of Applied Logic},
	author = {R. Goldblatt},
	year = {2003},
	pages = {309–392}
},

@article{van_benthem_information_2009,
	title = {The information in intuitionistic logic},
	volume = {167},
	number = {2},
	journal = {Synthese},
	author = {Johan van Benthem},
	year = {2009},
	pages = {251–270}
},

@book{rubinstein_modeling_1998,
	title = {Modeling Bounded Rationality},
	isbn = {0262681005, 9780262681001},
	publisher = {{MIT} Press},
	author = {Ariel Rubinstein},
	year = {1998},
	pages = {226}
},

@article{gettier_is_1963,
	title = {Is justified true belief knowledge?},
	journal = {Analysis},
	author = {E. L Gettier},
	year = {1963},
	pages = {121–123}
},

@incollection{kraus_knowledge_1986,
	title = {Knowledge, belief and time},
	url = {http://www.springerlink.com/content/7l60262h6x28w20w/},
	abstract = {In the conclusion of {[HM2]} Halpern and Moses expressed their interest in a logical system in which one could talk about knowledge and belief (and belief about knowledge, knowledge about belief and so on). We investigate such systems. In the first part of the paper knowledge and belief, without time, are considered. Common knowledge and common belief are defined and compared. A logical system and a family of models are proposed, a completeness result is proved and a decision procedure described. In the second part of the paper, time is considered. Different notions of beliefs are distinguished, obeying different properties of persistence. One interpretation of belief which obeys a very strong persistence axiom is put forward and used in the analysis of "wise men" puzzle.},
	booktitle = {Automata, Languages and Programming},
	author = {Sarit Kraus and Daniel Lehmann},
	year = {1986},
	pages = {186--195}
},

@book{friedl_mastering_2006,
	address = {Sebastopol  {CA}},
	edition = {3rd ed.},
	title = {Mastering regular expressions},
	isbn = {9780596528126},
	publisher = {{O'Reilly}},
	author = {Jeffrey Friedl},
	year = {2006}
},

@article{hintikka_knowing_1970,
	title = {{‘Knowing} that one knows’ reviewed},
	volume = {21},
	url = {http://dx.doi.org/10.1007/BF00413543},
	doi = {10.1007/BF00413543},
	number = {2},
	journal = {Synthese},
	author = {Jaakko K. Hintikka},
	month = jun,
	year = {1970},
	pages = {141--162}
},

@article{ono_logics_1985,
	title = {Logics Without the Contraction Rule},
	volume = {50},
	issn = {00224812},
	url = {http://www.jstor.org/stable/2273798},
	number = {1},
	journal = {The Journal of Symbolic Logic},
	author = {Hiroakira Ono and Yuichi Komori},
	month = mar,
	year = {1985},
	note = {{ArticleType:} primary\_article / Full publication date: Mar., 1985 / Copyright © 1985 Association for Symbolic Logic},
	pages = {169--201}
},

@book{bracewell_fourier_1999,
	edition = {3},
	title = {The Fourier Transform \& Its Applications},
	isbn = {0073039381},
	publisher = {{McGraw-Hill} {Science/Engineering/Math}},
	author = {Ronald Bracewell},
	month = jun,
	year = {1999}
},

@article{simpson_proof_1994,
	title = {The proof theory and semantics of intuitionistic modal logic},
	author = {A. K Simpson},
	year = {1994}
},

@misc{vietch_descartes_2005,
	title = {Descartes' Meditations},
	url = {http://www.wright.edu/cola/descartes/},
	author = {John Vietch and David B. Manley and Charles S. Taylor and René Descartes},
	month = jul,
	year = {2005},
	howpublished = {http://www.wright.edu/cola/descartes/}
},

@article{gdel_consistency_1938,
	title = {The consistency of the axiom of choice and of the generalized continuum-hypothesis},
	journal = {Proceedings of the National Academy of Sciences of the United States of America},
	author = {Kurt Gödel},
	year = {1938},
	pages = {556–557}
},

@incollection{fontaine_continuous_2008,
	title = {Continuous Fragment of the {mu-Calculus}},
	url = {http://dx.doi.org/10.1007/978-3-540-87531-4_12},
	abstract = {In this paper we investigate the Scott continuous fragment of the modal μ-calculus. We discuss its relation with constructivity, where we call a formula constructive if its least fixpoint is always
reached in at most ω steps. Our main result is a syntactic characterization of this continuous fragment. We also show that it is decidable whether
a formula is continuous.},
	booktitle = {Computer Science Logic},
	author = {Gaëlle Fontaine},
	year = {2008},
	pages = {139--153}
},

@book{knuth_art_1998,
	address = {Reading  Mass.},
	edition = {2nd ed.},
	title = {The Art of Computer Programming, Volume 3: Sorting and Searching},
	isbn = {9780201896855},
	publisher = {{Addison-Wesley}},
	author = {Donald Knuth},
	year = {1998}
},

@article{van_benthem_reflectionsepistemic_1991,
	title = {Reflections on epistemic logic},
	volume = {34},
	number = {133-134},
	journal = {Logique Anal., Nouv. Sér.},
	author = {Johan van Benthem},
	year = {1991},
	pages = {5–14}
},

@book{conee_evidentialism_2004,
	title = {Evidentialism},
	isbn = {0199253730},
	publisher = {Oxford University Press, {USA}},
	author = {Earl Conee and Richard Feldman},
	month = jun,
	year = {2004}
},

@article{williamson_two_1990,
	title = {Two Incomplete {Anti-Realist} Modal Epistemic Logics},
	volume = {55},
	issn = {00224812},
	url = {http://www.jstor.org/stable/2274969},
	number = {1},
	journal = {The Journal of Symbolic Logic},
	author = {Timothy Williamson},
	month = mar,
	year = {1990},
	note = {{ArticleType:} primary\_article / Full publication date: Mar., 1990 / Copyright © 1990 Association for Symbolic Logic},
	pages = {297--314}
},

@article{artemov_logic_1994,
	title = {Logic of proofs},
	volume = {67},
	number = {1},
	journal = {Annals of Pure and Applied Logic},
	author = {S. N. Artemov},
	year = {1994},
	pages = {29–60}
},

@book{pearl_causality_2000,
	title = {Causality},
	isbn = {0521773628, 9780521773621},
	publisher = {Cambridge University Press},
	author = {J. Pearl},
	year = {2000},
	pages = {412}
},

@book{stroustrup_c++_2000,
	title = {The C++ programming language},
	isbn = {0201700735, 9780201700732},
	publisher = {{Addison-Wesley}},
	author = {Bjarne Stroustrup},
	year = {2000},
	pages = {1046}
},

@article{barwise_scenes_1981,
	title = {Scenes and Other Situations},
	volume = {78},
	issn = {{0022362X}},
	url = {http://www.jstor.org/stable/2026481},
	number = {7},
	journal = {The Journal of Philosophy},
	author = {Jon Barwise},
	month = jul,
	year = {1981},
	note = {{ArticleType:} primary\_article / Full publication date: Jul., 1981 / Copyright © 1981 Journal of Philosophy, Inc.},
	pages = {369--397}
},

@misc{rumsfeld_defense.gov_2002,
	title = {Defense.gov News Transcript: {DoD} News Briefing - Secretary Rumsfeld and Gen. Myers},
	shorttitle = {{DoD} News Briefing - Secretary Rumsfeld and Gen. Myers},
	url = {http://www.defense.gov/transcripts/transcript.aspx?transcriptid=2636},
	author = {Donald H. Rumsfeld},
	month = feb,
	year = {2002},
	howpublished = {http://www.defense.gov/transcripts/transcript.aspx?transcriptid=2636}
},

@article{halpern_causes_2005-1,
	title = {Causes and explanations: A structural-model approach. Part I: Causes},
	volume = {56},
	shorttitle = {Causes and explanations},
	number = {4},
	journal = {British Journal for the Philosophy of Science},
	author = {J. Y Halpern and J. Pearl},
	year = {2005},
	pages = {843–888}
},

@article{alchourron_logic_1985,
	title = {On the Logic of Theory Change: Partial Meet Contraction and Revision Functions},
	volume = {50},
	issn = {00224812},
	shorttitle = {On the Logic of Theory Change},
	url = {http://www.jstor.org/stable/2274239},
	number = {2},
	journal = {The Journal of Symbolic Logic},
	author = {Carlos E. Alchourron and Peter Gardenfors and David Makinson},
	month = jun,
	year = {1985},
	note = {{ArticleType:} primary\_article / Full publication date: Jun., 1985 / Copyright © 1985 Association for Symbolic Logic},
	pages = {510--530}
},

@article{hendricks_wheresbridge?_2006,
	title = {Where’s the bridge? Epistemology and epistemic logic},
	volume = {128},
	shorttitle = {Where’s the bridge?},
	number = {1},
	journal = {Philosophical Studies},
	author = {V. F Hendricks and J. Symons},
	year = {2006},
	pages = {137–167}
},

@inproceedings{plotkin_framework_1986,
	title = {A framework for intuitionistic modal logics: extended abstract},
	shorttitle = {A framework for intuitionistic modal logics},
	booktitle = {Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge},
	author = {G. Plotkin and C. Stirling},
	year = {1986},
	pages = {406}
},

@book{meyer_epistemic_1995,
	title = {Epistemic Logic for {AI} and Computer Science},
	isbn = {0521602807, 9780521602808},
	publisher = {Cambridge University Press},
	author = {{John-Jules} Ch Meyer and Wiebe van der Hoek},
	year = {1995},
	pages = {376}
},

@article{fairtlough_propositional_1997,
	title = {Propositional Lax Logic},
	volume = {137},
	issn = {0890-5401},
	url = {http://www.sciencedirect.com/science/article/B6WGK-45M91WN-7/2/d1eeeb63a7107c1e59d725d7bbb1bace},
	doi = {10.1006/inco.1997.2627},
	abstract = {We investigate a peculiar intuitionistic modal logic, called Propositional Lax Logic {(PLL),} which has promising applications to the formal verification of computer hardware. The logic has emerged from an attempt to express correctness up to behavioural constraints--a central notion in hardware verification--as a logical modality. As a modal logic it is special since it features a single modal operator [circle, open] that has a flavour both of possibility and of necessity. In the paper we provide the motivation for {PLL} and present several technical results. We investigate some of its proof-theoretic properties, presenting a cut-elimination theorem for a standard Gentzen-style sequent presentation of the logic. We go on to define a new class of fallible two-frame Kripke models for {PLL.} These models are unusual since they feature worlds with inconsistent information; furthermore, the only frame condition imposed is that the [circle, open]-frame be a subrelation of the [superset or implies]-frame. We give a natural translation of these models into Goldblatt's -space models of {PLL.} Our completeness theorem for these models yields a Gödel-style embedding of {PLL} into a classical bimodal theory of type {(S4,} S4) and underpins a simple proof of the finite model property. We proceed to prove soundness and completeness of several theories for specialized classes of models. We conclude with a brief exploration of two concrete and rather natural types of model from hardware verification for which the modality [circle, open] models correctness up to timing constraints. We obtain decidability of [circle, open]-free fragment of the logic of the first type of model, which coincides with the stable form of Maksimova's intermediate {logicL[Pi].}},
	number = {1},
	journal = {Information and Computation},
	author = {Matt Fairtlough and Michael Mendler},
	month = aug,
	year = {1997},
	pages = {1--33}
},

@article{hommersom_update_2004,
	title = {Update semantics of security protocols},
	volume = {142},
	number = {2},
	journal = {Synthese},
	author = {A. Hommersom and {John-Jules} Ch Meyer and E. De Vink},
	year = {2004},
	pages = {229–267}
}